The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices
نویسندگان
چکیده
W e present a deterministic polynomial-time algorithm for the ABC problem, which is the membership problem for 2-generated commutative linear semigroups over an algebraic number field. W e also obtain a polynomial t ime algorithm for the (easier) membership problem for 2-generated abelian linear groups. Furthermore, we provide a polynomial-sized encoding for the set of all solutions.
منابع مشابه
On semigroups with PSPACE-complete subpower membership problem
Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) for S asks whether b can be generated by a1, . . . , ak. For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups wit...
متن کاملThe subpower membership problem for semigroups
Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) asks whether b can be generated by a1, . . . , ak. If S is a finite group, then there is a folklore algorithm that decides this problem in time polynomial in nk. For semigroups this problem always lies in PSPACE. We show that the SMP for a full transformation semigroup on 3 o...
متن کاملOn The Complexity of the Cayley Semigroup Membership Problem
We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is NL-complete and that the more general Cayley groupoid membership problem, where the multiplication table is not required to be associative, is P-complete. For gro...
متن کاملOn Polynomial Ideals, Their Complexity, and Applications
A polynomial ideal membership problem is a (w+1)-tuple P = (f; g 1 ; g 2 ; : : : ; g w) where f and the g i are multivariate polynomials over some ring, and the problem is to determine whether f is in the ideal generated by the g i. For polynomials over the integers or rationals, it is known that this problem is exponential space complete. We discuss complexity results known for a number of pro...
متن کاملEquations on Semidirect Products of Commutative Semigroups
In this paper; we study equations on semidirect products of commutative semigroups. Let Comq,r denote the pseudovariety of all finite semigroups that satisfy the equations xy = yx and x r + q = xr. The pseudovariety Com1,1 is the pseudovariety of all finite semilattices. We consider the product pseudovariety Comq,r * generated by all semidirect products of the form S*T with S ∈ Comq,r and T ∈ ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994